On a partial order defined by the weighted Moore–Penrose inverse
نویسندگان
چکیده
منابع مشابه
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not only assume that the chains have bounded size, but also that a weight wi is given for each element i in the partial order such that wi ≤ wj if i ≺ j. The problem is then to partition the partial order into a minimum-we...
متن کاملa study on insurer solvency by panel data model: the case of iranian insurance market
the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.
global results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Weighted parametric tests defined by graphs
This document describes how to use gMCP to construct, conduct and evaluate multiple comparison procedures based on weighted parametric tests which are defined by directed graphs. In addition to sequentially rejective Bonferroni procedures gMCP provides functionality to construct tests that take advantage of (partial) knowledge of the the joint distribution of the p-values associated with multip...
متن کاملOn the inverse of a class of weighted graphs
In this article, only connected bipartite graphs G with a unique perfect matching M are considered. Let Gw denote the weighted graph obtained from G by giving weights to its edges using the positive weight function w : E(G)→ (0,∞) such that w(e) = 1 for each e ∈ M. An unweighted graph G may be viewed as a weighted graph with the weight function w ≡ 1 (all ones vector). A weighted graph Gw is no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2013
ISSN: 0096-3003
DOI: 10.1016/j.amc.2013.02.010